Breakup Algorithm for Switching Circuit Simplifications
نویسندگان
چکیده
منابع مشابه
An Innovative Simple Test Circuit for Single-Phase Short Circuit Making Test of High-Voltage Switching Devices
Nowadays, high-voltage circuit breakers have reached such high short-circuit capabilities that testing them under the full rated voltage is generally not possible with direct tests, and they are conducted by using the synthetic test methods. Although the phenomena associated with making tests is of particular importance especially in case of load break switches, but making tests are rather d...
متن کاملSWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...
متن کاملan innovative simple test circuit for single-phase short circuit making test of high-voltage switching devices
nowadays, high-voltage circuit breakers have reached such high short-circuit capabilities that testing them under the full rated voltage is generally not possible with direct tests, and they are conducted by using the synthetic test methods. although the phenomena associated with making tests is of particular importance especially in case of load break switches, but making tests are rather disr...
متن کاملSimplifications and speedups of the pseudoflow algorithm
The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum in [13]. The complexity of the algorithm was shown in [13] to be O(nm log n). In [5] Chandran and Hochbaum demonstrated that the pseudoflow algorithm is very efficient in practice, and that the highest label version of the algorithm tends to perform best. Here we improve the running time of th...
متن کاملMulticommodity Flow and Circuit Switching
Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity ow based approach of Leighton & Rao to show that \short" ow-paths lead to path-selections with \low" congestion. This shows that such good path-selections exist for const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING AND MANAGEMENT
سال: 2016
ISSN: 2456-8066
DOI: 10.24999/ijoaem/01010001